use of the improved frog-leaping algorithm in data clustering

clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. k-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. in recent years, several algorithms are provided based on evolutionary algorithms for clustering, but unfortunately they have shown disappointing behavior. in this study, a shuffled frog leaping algorithm (lsfla) is proposed for clustering, where the concept of mixing and chaos is used to raise the accuracy of the algorithm. because the use of concept of entropy in the fitness functions, we are able to raise the efficiency of the algorithm for clustering. to perform the test, the four sets of real data are used which have been compared with the algorithms k-menas, ga, pso, cpso. the results show better performance of this method in the clustering.